On the Ability of a Probabilistic Context-Free Grammar for Reducing Ambiguity
نویسندگان
چکیده
This paper studies the ambiguity reduction ability of the probabilistic contextfree grammar. We theoretically analyze the common behavior of any probabilistic context-free grammar. Moreover, we con rm by experiments that a probabilistic context-free grammar learnt from Japanese corpus has the ambiguity reduction ability as expected by the theoretical analysis.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملComparing the Ambiguity Reduction Abilities of Probabilistic Context-Free Grammars
We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambiguity resolution capabilities. Probabilities in a PCFG can be seen as a filtering mechanism: For an ambiguous sentence, the trees bearing maximum probability are single out, while all others are discarded. The level of ambiguity is related to the size of the singled out set of trees. Under our meas...
متن کاملOn the unary equivalence of stochastic languages and stochastic context-free languages
We show that every unary stochastic context-free grammar with polynomially bounded ambiguity, has an equivalent probabilistic automaton.
متن کاملA Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which are implausible. In order to deal with ambiguity, the MORphological PArser MORPA is provided with a probabilistic context-free grammar (PCFG), i.e. it combines a "conventional" context-free morphological grammar to fi...
متن کاملPruning the Search Space of the Wolof LFG Grammar Using a Probabilistic and a Constraint Grammar Parser
This paper presents a method for greatly reducing parse times in LFG by integrating a Constraint Grammar (CG) parser into a probabilistic context-free grammar. The CG parser is used in the pre-processing phase to reduce morphological and lexical ambiguity. Similarly, the c-structure pruning mechanism of XLE is used in the parsing phase to discard low-probability c-structures, before f-annotatio...
متن کامل